On iteration in planar domains.
نویسندگان
چکیده
منابع مشابه
A Note on Random Holomorphic Iteration in Convex Domains
We introduce a geometric condition of Bloch type which guarantees that a subset of a bounded convex domain in several complex variables is degenerate with respect to every iterated function system. Furthermore we discuss the relations of such a Bloch type condition with the analogous hyperbolic Lipschitz condition.
متن کاملQuasiconformally Homogeneous Planar Domains
In this paper we explore the ambient quasiconformal homogeneity of planar domains and their boundaries. We show that the quasiconformal homogeneity of a domain D and its boundary E implies that the pair (D,E) is in fact quasiconformally bi-homogeneous. We also give a geometric and topological characterization of the quasiconformal homogeneity of D or E under the assumption that E is a Cantor se...
متن کاملStatic Analysis by Policy Iteration on Relational Domains
We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least fixpoint) of a system of equations in the abstract numerical domains of zones and templates used for static analysis of programs by abstract interpretation. This paper extends previous work on the non-relational domain of intervals to relational domains. The algorithm is based on policy iteration techn...
متن کاملPolicy Iteration within Logico-Numerical Abstract Domains
Policy Iteration is an algorithm for the exact solving of optimization and game theory problems, formulated as equations on min max affine expressions. It has been shown that the problem of finding the least fixpoint of semantic equations on some abstract domains can be reduced to such optimization problems. This enables the use of Policy Iteration to solve such equations, instead of the tradit...
متن کاملBatch Policy Iteration Algorithms for Continuous Domains
This paper establishes the link between an adaptation of the policy iteration method for Markov decision processes with continuous state and action spaces and the policy gradient method when the differentiation of the mean value is directly done over the policy without parameterization. This approach allows deriving sound and practical batch Reinforcement Learning algorithms for continuous stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 1997
ISSN: 0026-2285
DOI: 10.1307/mmj/1029005620